‘When Historians Gossip’ A Review
نویسندگان
چکیده
منابع مشابه
When Knowing Early Matters: Gossip, Percolation and Nash Equilibria
Continually arriving information is communicated through a network of n agents, with the value of information to the j’th recipient being a decreasing function of j/n, and communication costs paid by recipient. Regardless of details of network and communication costs, the social optimum policy is to communicate arbitrarily slowly. But selfish agent behavior leads to Nash equilibria which (in th...
متن کاملWhen Gossip Meets Consensus: Convergence in Correlated Random WSNs
We study the convergence of consensus algorithms in wireless sensor networks with random topologies where the instantaneous links exist with a given probability and are allowed to be spatially correlated. Aiming at minimizing the convergence time of the algorithm, we adopt an optimization criterion based on the spectral radius of a positive semidefinite matrix for which we derive closed-form ex...
متن کاملWhen Do Gossip Algorithms Converge in Finite Time?
In this paper, we study finite-time convergence of gossip algorithms. We show that there exists a symmetric gossip algorithm that converges in finite time if and only if the number of network nodes is a power of two, while there always exists a globally finite-time convergent gossip algorithm despite the number of nodes if asymmetric gossiping is allowed. For n = 2 nodes, we prove that a fastes...
متن کاملDirectional Gossip: Gossip in a Wide Area Network
A reliable multicast protocol ensures that all of the intended recipients of a message m that do not fail eventually deliver m. For example, consider the reliable multicast protocol of [10], and consider a message m, sent by process p1, that is intended to be delivered by p1, p2, and p3. We impose a directed spanning tree on these processes that is rooted at the message source. For example, for...
متن کاملGGRA: a grouped gossip-based reputation aggregation algorithm
An important issue in P2P networks is the existence of malicious nodes that decreases the performance of such networks. Reputation system in which nodes are ranked based on their behavior, is one of the proposed solutions to detect and isolate malicious (low ranked) nodes. Gossip Trust is an interesting previously proposed algorithm for reputation aggregation in P2P networks based on t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Central and Eastern European Review
سال: 2016
ISSN: 1752-7503
DOI: 10.1515/caeer-2017-0004